${\mathbb {Z}}_{2}{\mathbb {Z}}_{4}$ -Additive Cyclic Codes, Generator Polynomials, and Dual Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Z2Z4-additive cyclic codes, generator polynomials and dual codes

A Z2Z4-additive code C ⊆ Z2 ×Zβ4 is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z2 and the set of Z4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. These codes can be identified as submodules of the Z4[x]-module Z2[x]/(x− 1)×Z4[x]/(x − 1). The parameters of a Z2Z4-additive cyclic code are stated i...

متن کامل

Computing the generator polynomials of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes

A Z2Z4-additive code C ⊆ Z α 2 × Z β 4 is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z2 and the set of Z4 coordinates, such that any simultaneous cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z4[x]-module Z2[x]/(x − 1)×Z4[x]/(x −1). Any Z2Z4-additive cyclic code C is of t...

متن کامل

Generator polynomials and generator matrix for quasi cyclic codes

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length sl with index s over the finite field F are F[y]-submodules of the ring F[x, y]/< x − 1, y − 1 >. The aim of the present paper, is to study QC codes of length sl with index s over the finite field F and find generator polynomials and generator matrix for these codes. To achieve this...

متن کامل

On cyclic DNA codes over the Ring $\Z_4 + u \Z_4$

In this paper, we study the theory for constructing DNA cyclic codes of odd length over Z4[u]/〈u 2〉 which play an important role in DNA computing. Cyclic codes of odd length over Z4+uZ4 satisfy the reverse constraint and the reverse-complement constraint are studied in this paper. The structure and existence of such codes are also studied. The paper concludes with some DNA example obtained via ...

متن کامل

$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes

Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2016

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2016.2611528